منابع مشابه
Constructing Optimal Highways
For two points p and q in the plane, a straight line h, called a highway, and a real v > 1, we define the travel time (also known as the city distance) from p and q to be the time needed to traverse a quickest path from p to q, where the distance is measured with speed v on h and with speed 1 in the underlying metric elsewhere. Given a set S of n points in the plane and a highway speed v, we co...
متن کاملConstructing Optimal Axis-Parallel Highways
In this paper we consider the problem of constructing optimal highways. For two points p and q in the plane, a line h—the highway—and a real v > 1, we define the travel time (also known as the City distance) from p and q to be the time needed to traverse a quickest path from p to q, where distances are measured in the Manhattan (i.e. the L1-) metric, and the speed on h is v and elsewhere 1. Giv...
متن کاملConstructing Optimal Wavelet Synopses
The wavelet decomposition is a proven tool for constructing concise synopses of massive data sets and rapid changing data streams, which can be used to obtain fast approximate, with accuracy guarantees, answers. In this work we present a generic formulation for the problem of constructing optimal wavelet synopses under space constraints for various error metrics, both for static and streaming d...
متن کاملConstructing Optimal IP Routing Tables
The Border Gateway Protocol (BGP) populates Internet backbone routers with routes or prefixes. We present an algorithm to locally compute (without any modification to BGP) equivalent forwarding tables that provably contain the minimal number of prefixes. For large backbone routers, the Optimal Routing Table Constructor (ORTC) algorithm that we present produces routing tables with roughly 60% of...
متن کاملConstructing Optimal Trees from Quartets
We present fast new algorithms for constructing phylogenetic trees from quarŽ . tets resolved trees on four leaves . The problem is central to divide-and-conquer approaches to phylogenetic analysis and has been receiving considerable attention from the computational biology community. Most formulations of the problem are NP-hard. Here we consider a number of constrained versions that have polyn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2009
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054109006425